SSABA: Search Step Adjustment Based Algorithm

نویسندگان

چکیده

Finding the suitable solution to optimization problems is a fundamental challenge in various sciences. Optimization algorithms are one of effective stochastic methods solving problems. In this paper, new algorithm called Search Step Adjustment Based Algorithm (SSABA) presented provide quasi-optimal solutions initial iterations algorithm, step index set highest value for comprehensive search space. Then, with increasing repetitions order focus achieving optimal closer global optimal, reduced reach minimum at end implementation. SSABA mathematically modeled and its performance evaluated on twenty-three different standard objective functions unimodal multimodal types. The results show that proposed has high exploitation power appropriate exploration algorithm. addition, compared eight well-known algorithms, including Particle Swarm (PSO), Genetic (GA), Teaching-Learning (TLBO), Gravitational (GSA), Grey Wolf (GWO), Whale (WOA), Marine Predators (MPA), Tunicate (TSA). simulation better more competitive than performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block-Matching Algorithm Based on Dynamic Search Window Adjustment

Dynamic search window adjustment for block-matching algorithm(BMA) based on the block similarity to overcome the computational complexity of full search BMA is presented. The proposed method for adjustment of the size of search window is performed with three steps:(1)Set newsearch origin basedonblock similarity anddisplacedblockdifference(DBD), as a displacement of the block which has smaller D...

متن کامل

Dynamic Step Size Adjustment in Iterative Deepening Search

If an iterative deepening search (IDS) procedure has the property that solutions at a given iteration are also found at later iterations, it is possible to skip iterations without loss of correctness. We examine the conditions required for skipping to be worthwhile and give an algorithm for dynamically adapting the skipping to the behaviour of the search procedure. We consider the problem f wit...

متن کامل

Variable step search algorithm for feedforward networks

A new class of search-based training algorithms for feedforward networks is introduced. These algorithms do not calculate analytical gradients and do not use stochastic or genetic search techniques. The forward step is performed to calculate error in response to localized weight changes using systematic search techniques. One of the simplest variants of this type of algorithms, the Variable Ste...

متن کامل

LMS Algorithm Step Size Adjustment for Fast Convergence

In the areas of acoustic research or applications that deal with not-precisely-known or variable conditions, a method of adaptation to the uncertainness or changes is usually necessary. When searching for an adaptation algorithm, it is hard to overlook the least mean squares (LMS) algorithm. Its simplicity, speed of computation, and robustness has won it a wide area of applications: from teleco...

متن کامل

AN IMPROVED INTELLIGENT ALGORITHM BASED ON THE GROUP SEARCH ALGORITHM AND THE ARTIFICIAL FISH SWARM ALGORITHM

This article introduces two swarm intelligent algorithms, a group search optimizer (GSO) and an artificial fish swarm algorithm (AFSA). A single intelligent algorithm always has both merits in its specific formulation and deficiencies due to its inherent limitations. Therefore, we propose a mixture of these algorithms to create a new hybrid optimization algorithm known as the group search-artif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers, materials & continua

سال: 2022

ISSN: ['1546-2218', '1546-2226']

DOI: https://doi.org/10.32604/cmc.2022.023682